Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem
نویسندگان
چکیده
منابع مشابه
A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
In recent years, a large number of heuristics have been proposed for the minimization of the total or mean flowtime/completion time of the well-known permutation flowshop scheduling problem. Although some literature reviews and comparisons have been made, they do not include the latest available heuristics and results are hard to compare as no common benchmarks and computing platforms have been...
متن کاملAnt-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs
The problem of scheduling in permutation flowshops is considered with the objective of minimizing the makespan, followed by the consideration of minimization of total flowtime of jobs. Two ant-colony optimization algorithms are proposed and analyzed for solving the permutation flowshop scheduling problem. The first algorithm extends the ideas of the ant-colony algorithm by Stuetzle [Proceedings...
متن کاملAn Improved Particle Swarm Optimization for Permutation Flowshop Scheduling Problem with Total Flowtime Criterion
This paper deals with the m-machine permutation flowshop scheduling problem to minimize the total flowtime, an NP-complete problem, and proposes an improved particle swarm optimization (PSO) algorithm. To enhance the exploitation ability of PSO, a stochastic iterated local search is incorporated. To improve the exploration ability of PSO, a population update method is applied to replace non-pro...
متن کاملIterative Heuristics for Permutation Flow Shops with Total Flowtime Minimization
In this paper, flow shop scheduling problems with total flowtime minimization is considered. IRZ (iterative RZ, presented by Rajendran and Ziegler, EJOR, 1997) is found to be effective to improve solutions and LR (developed by Liu & Reeves, EJOR, 2001) is suitable for initial solution developing. By integrating FPE (forward pair wise exchange) and FPE-R(forward pair wise exchangerestart) with I...
متن کاملNew VNS heuristic for total flowtime flowshop scheduling problem
This paper develops a new VNS approach to Permutational Flow shop Scheduling Problem with Total Flow time criterion. There are many hybrid approaches in the problem’s literature, that make use of VNS internally, usually applying job insert neighbourhood followed by job interchange neighbourhood. In this study different ways to combine both neighbourhoods were examined. All tests use the benchma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Expert Systems with Applications
سال: 2019
ISSN: 0957-4174
DOI: 10.1016/j.eswa.2019.01.062